首页> 外文OA文献 >Joint Pushing and Caching for Bandwidth Utilization Maximization in Wireless Networks
【2h】

Joint Pushing and Caching for Bandwidth Utilization Maximization in Wireless Networks

机译:用于带宽利用最大化的联合推送和缓存   无线网络

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

Joint pushing and caching is recognized as an efficient remedy to the problemof spectrum scarcity incurred by tremendous mobile data traffic. In this paper,by exploiting storage resources at end users and predictability of user demandprocesses, we design the optimal joint pushing and caching policy to maximizebandwidth utilization, which is of fundamental importance to mobile telecomcarriers. In particular, we formulate the stochastic optimization problem as aninfinite horizon average cost Markov Decision Process (MDP), for which theregenerally exist only numerical solutions without many insights. By structuralanalysis, we show how the optimal policy achieves a balance between the currenttransmission cost and the future average transmission cost. In addition, weshow that the optimal average transmission cost decreases with the cache size,revealing a tradeoff between the cache size and the bandwidth utilization.Then, due to the fact that obtaining a numerical optimal solution suffers thecurse of dimensionality and implementing it requires a centralized controllerand global system information, we develop a decentralized policy withpolynomial complexity w.r.t. the numbers of users and files as well as cachesize, by a linear approximation of the value function and optimizationrelaxation techniques. Next, we propose an online decentralized algorithm toimplement the proposed low-complexity decentralized policy using the techniqueof Q-learning, when priori knowledge of user demand processes is not available.Finally, using numerical results, we demonstrate the advantage of the proposedsolutions over some existing designs. The results in this paper offer usefulguidelines for designing practical cache-enabled content-centric wirelessnetworks.
机译:联合推送和缓存被认为是解决由于巨大的移动数据流量而引起的频谱稀缺问题的有效方法。本文通过利用最终用户的存储资源和用户需求过程的可预测性,设计了优化的联合推送和缓存策略,以最大化带宽利用率,这对移动电信运营商至关重要。特别地,我们将随机优化问题表述为无限远景平均成本马尔可夫决策过程(MDP),对此,通常只存在数值解而没有很多见识。通过结构分析,我们显示了最佳策略如何在当前传输成本和未来平均传输成本之间取得平衡。此外,我们表明最优平均传输成本随缓存大小而降低,从而揭示了缓存大小和带宽利用率之间的权衡。然后,由于获得数值最优解会遭受维度的困扰,因此实现它需要集中控制器和全球系统信息,我们开发了一种具有多项式复杂度的分散策略通过值函数和优化松弛技术的线性近似,可以得到用户和文件的数量以及缓存大小。接下来,当用户需求过程的先验知识不可用时,我们提出了一种在线分散算法,以使用Q学习技术来实现拟议的低复杂度分散策略。最后,使用数值结果,我们证明了所提出的解决方案相对于某些现有方案的优势设计。本文的结果为设计实用的启用缓存的以内容为中心的无线网络提供了有用的指导。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号